Preconditioners for the dual-primal FETI methods on nonmatching grids: Numerical study

نویسندگان

  • Yeon-Woo Chang
  • Hyea Hyun Kim
  • Chang-Ock Lee
چکیده

FETI-DP method is a substructuring method that uses Lagrange multipliers to match the continuity condition on the subdomain boundaries. For the FETI-DP method on nonmatching grids, two different formulations are known with respect to how to employ the mortar matching condition. Keeping step with the developments of the FETI-DP methods, a variety of preconditioners for the FETI-DP operator have been developed. However, there has not been any numerical study for the FETI-DP method, which compares those preconditioners on nonmatching grids while there have been a few of literatures for numerical study on the comparison of FETI preconditioners. Therefore, we present the numerical study of four different preconditioners for two dimensional elliptic problems. The numerical results confirm the superiority of the preconditioner by Kim and Lee [6] for noncomparably nonmatching grids, while the superiority of the preconditioner by Dryja and Widlund [2] is confirmed for matching grids and comparably nonmatching grids.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Preconditioner for the FETI-DP Formulation with Mortar Methods in Two Dimensions

In this paper, we consider a dual-primal FETI (FETI-DP) method for elliptic problems on nonmatching grids. The FETI-DP method is a domain decomposition method that uses Lagrange multipliers to match solutions continuously across subdomain boundaries in the sense of dual-primal variables. We use the mortar matching condition as the continuity constraints for the FETI-DP formulation. We construct...

متن کامل

A Preconditioner for the Feti-dp Formulation of the Stokes Problem with Mortar Methods

We consider a FETI-DP formulation for the Stokes problem on nonmatching grids in 2D. The FETI-DP method is a domain decomposition method that uses Lagrange multipliers to match the solutions continuously across the subdomain boundaries in the sense of dual-primal variables. We use the mortar matching condition as the continuity constraints for the FETI-DP formulation. Moreover, to satisfy the c...

متن کامل

A FETI-DP Formulation for Two-dimensional Stokes Problem on Nonmatching Grids

We consider a FETI-DP formulation of the Stokes problem with mortar methods. To solve the Stokes problem correctly and efficiently, redundant continuity constraints are introduced. Lagrange multipliers corresponding to the redundant constraints are treated as primal variables in the FETI-DP formulation. We propose a preconditioner for the FETI-DP operator and show that the condition number of t...

متن کامل

3. A Generalized FETI - DP Method for a Mortar Discretization of Elliptic Problems

1. Introduction. In this paper, an iterative substructuring method with La-grange multipliers is proposed for discrete problems arising from approximations of elliptic problem in two dimensions on non-matching meshes. The problem is formulated using a mortar technique. The algorithm belongs to the family of dual-primal FETI (Finite Element Tearing and Interconnecting) methods which has been ana...

متن کامل

On the Equivalence of Primal and Dual Substructuring Preconditioners

After a short historical review, we present four popular substructuring methods: FETI-1, BDD, FETI-DP, BDDC, and derive the primal versions to the two FETI methods, called PFETI-1 and P-FETI-DP, as proposed by Fragakis and Papadrakakis. The formulation of the BDDC method shows that it is the same as P-FETI-DP and the same as a preconditioner introduced by Cros. We prove the equality of eigenval...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2006